Recording and Checking HOL Proofs
نویسنده
چکیده
Formal proofs generated by mechanised theorem proving systems may consist of a large number of inferences. As these theorem proving systems are usually very complex, it is extremely diicult if not impossible to formally verify them. This calls for an independent means of ensuring the consistency of mechanically generated proofs. This paper describes a method of recording HOL proofs in terms of a sequence of applications of inference rules. The recorded proofs can then be checked by an independent proof checker. Also described in this paper is an eecient proof checker which is able to check a practical proof consisting of thousands of inference steps.
منابع مشابه
Efficiently Checking Propositional Resolution Proofs in Isabelle/HOL
This paper describes the integration of zChaff and MiniSat, currently two leading SAT solvers, with Isabelle/HOL. Both SAT solvers generate resolution-style proofs for (instances of) propositional tautologies. These proofs are verified by the theorem prover. The presented approach significantly improves Isabelle’s performance on propositional problems, and exhibits counterexamples for unprovabl...
متن کاملPeterson’s Algorithm in Isabelle/HOL
Peterson’s algorithm [Pet81] is designed to ensure mutual exclusion between two processes without any special hardware support. Peterson’s algorithm has been formalised and verified several times. Although the algorithm is essentially finite state, and therefore susceptible to model checking, we provide an invariant style proof. Invariant style proofs illustrate techniques that are usable for p...
متن کاملFormalisation and Analysis of Component Dependencies
This set of theories presents a formalisation in Isabelle/HOL [3] of data dependencies between components. The approach allows to analyse system structure oriented towards efficient checking of system: it aims at elaborating for a concrete system, which parts of the system (or system model) are necessary to check a given property.
متن کاملProof-checking Euclid
We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski’s formal geometry. We used proofs as close as possible to those given by Euclid, but filling Euclid’s gaps and correcting errors. Euclid Book I has 48 propositions; we pr...
متن کاملFast LCF-Style Proof Reconstruction for Z3
The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers Isabelle/HOL and HOL4 with particular focus on efficiency. Our highly optimized implementations outperform previous LCF-style proof checkers for SMT, often by orders of magnitude. Detailed performance data shows that LCF-style p...
متن کامل